Density Theorems for Intersection Graphs of t-Monotone Curves

نویسنده

  • Andrew Suk
چکیده

A curve γ in the plane is t-monotone if its interior has at most t− 1 vertical tangent points. A family of t-monotone curves F is simple if any two members intersect at most once. It is shown that if F is a simple family of n t-monotone curves with at least ǫn intersecting pairs (disjoint pairs), then there exists two subfamilies F1, F2 ⊂ F of size δn each, such that every curve in F1 intersects (is disjoint to) every curve in F2, where δ depends only on ǫ. We apply these results to find pairwise disjoint edges in simple topological graphs with t-monotone edges.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coloring intersection graphs of x-monotone curves in the plane

A class of graphs G is χ-bounded if the chromatic number of the graphs in G is bounded by some function of their clique number. We show that the class of intersection graphs of simple families of x-monotone curves in the plane intersecting a vertical line is χ-bounded. As a corollary, we show that the class of intersection graphs of rays in the plane is χ-bounded, and the class of intersection ...

متن کامل

Outerstring graphs are chi-bounded

An outerstring graph is an intersection graph of curves lying in a halfplane with one endpoint on the boundary of the halfplane. It is proved that the outerstring graphs are χ-bounded, that is, their chromatic number is bounded by a function of their clique number. This generalizes a series of previous results on χ-boundedness of outerstring graphs with various restrictions of the shape of the ...

متن کامل

Bhaskar-Lakshmikantham type results for monotone mappings in partially ordered metric spaces

In this paper, coupled xed point results of Bhaskar-Lakshmikantham type [T. Gnana Bhaskar, V.Lakshmikantham, Fixed point theorems in partially ordered metric spaces and applications, NonlinearAnalysis 65 (2006) 1379-1393] are extend, generalized, unify and improved by using monotonemappings instead mappings with mixed monotone property. Also, an example is given to supportthese improvements.

متن کامل

The Coupling Method for Inhomogeneous Random Intersection Graphs

We present new results concerning threshold functions for a wide family of random intersection graphs. To this end we improve and generalize the coupling method introduced for random intersection graphs so that it may be used for a wider range of parameters. Using the new approach we are able to tighten the best known results concerning random intersection graphs and establish threshold functio...

متن کامل

Turán-type results for partial orders and intersection graphs of convex sets

We prove Ramsey-type results for intersection graphs of geometric objects the plane. In particular, we prove the following bounds, all of which are tight apart from the constant c. There is a constant c > 0 such that for every family F of n ≥ 2 convex sets in the plane, the intersection graph of F or its complement contains a balanced complete bipartite graph of size at least cn. There is a con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012